An improved estimation of distribution algorithm for multi-compartment electric vehicle routing problem
نویسندگان
چکیده
The multi-compartment electric vehicle routing problem (EVRP) with soft time window and multiple charging types (MCEVRP-STW&MCT) is studied, in which vehicles that are environmentally friendly but need to be recharged course of transport process, employed. A mathematical model for this optimization established the objective minimizing function composed cost, distribution penalty cost service cost. To solve problem, an estimation algorithm based on Lévy flight (EDA-LF) proposed perform a local search at each iteration prevent from falling into optimum. Experimental results demonstrate EDA-LF can find better solutions has stronger robustness than basic EDA algorithm. In addition, when comparing existing algorithms, result shows often get relatively short solving medium large-scale instances. Further experiments show using deliver incompatible products produce traditional fuel vehicles.
منابع مشابه
An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn efficient heuristic for the Multi-compartment Vehicle Routing Problem
We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heur...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2021
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2021.000030